Performance of shortest path algorithm based on parallel vertex traversal
نویسندگان
چکیده
منابع مشابه
Expected Performance of Dijkstra's Shortest Path Algorithm
We show that the expected number of decrease-key operations in Dijkstra's shortest path algorithm is O(n log(1+m=n)) for an n-vertex, m-arc graph. The bound holds for any graph structure; the only assumption we make is that for every vertex, the lengths of its incoming arcs are drawn independently from the same distribution. The same bound holds with high probability. This result explains the s...
متن کاملParallel Shortest Path Searching Algorithm on Dynamically Reconfigurable Processor
This paper proposes a parallel shortest pathsearching algorithm and implements it on a newly structured parallel reconfigurable processor, DAPDNA-2 (IPFlex Inc). The proposed algorithm can be applied to the very large Internet network designs of the future.
متن کاملAll-pairs Shortest Path Algorithm based on MPI+CUDA Distributed Parallel Programming Model
In view of the problem that computing shortest paths in a graph is a complex and time-consuming process, and the traditional algorithm that rely on the CPU as computing unit solely can't meet the demand of real-time processing, in this paper, we present an all-pairs shortest paths algorithm using MPI+CUDA hybrid programming model, which can take use of the overwhelming computing power of the GP...
متن کاملDelta-Stepping: A Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کامل-stepping : a Parallel Single Source Shortest Path Algorithm
In spite of intensive research, little progress has been made towards fast and work-eecient parallel algorithms for the single source shortest path problem. Our-stepping algorithm, a generalization of Dial's algorithm and the Bellman-Ford algorithm, improves this situation at least in the following \average-case" sense: For random directed graphs with edge probability d n and uniformly distribu...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Serbian Journal of Electrical Engineering
سال: 2016
ISSN: 1451-4869,2217-7183
DOI: 10.2298/sjee1601031v